Counting Constraint Satisfaction Problems
نویسنده
چکیده
This chapter surveys counting Constraint Satisfaction Problems (counting CSPs, or #CSPs) and their computational complexity. It aims to provide an introduction to the main concepts and techniques, and present a representative selection of results and open problems. It does not cover holants, which are the subject of a separate chapter. 1998 ACM Subject Classification F.2.2 Nonnumerical Algorithms and Problems
منابع مشابه
Counting-Based Search for Constraint Optimization Problems
Branching heuristics based on counting solutions in constraints have been quite good at guiding search to solve constraint satisfaction problems. But do they perform as well for constraint optimization problems? We propose an adaptation of counting-based search for optimization, show how to modify solution density computation for some of the most frequently-occurring constraints, and empiricall...
متن کاملQuantified Constraints: The Complexity of Decision and Counting for Bounded Alternation
We consider constraint satisfaction problems parameterized by the set of allowed constraint predicates. We examine the complexity of quantified constraint satisfaction problems with a bounded number of quantifier alternations and the complexity of the associated counting problems. We obtain classification results that completely solve the Boolean case, and we show that hardness results carry ov...
متن کاملCounting, Structure Identification and Maximum Consistency for Binary Constraint Satisfaction Problems
Using a framework inspired by Schaefer's generalized satissability model Sch78], Cooper, Cohen and Jeavons CCJ94] studied the complexity of constraint satisfaction problems in the special case when the set of constraints is closed under permutation of labels and domain restriction, and precisely identiied the tractable (and intractable) cases. Using the same model we characterize the complexity...
متن کاملApproximate Counting for Complex-Weighted Boolean Constraint Satisfaction Problems
Constraint satisfaction problems (or CSPs) have been extensively studied in, for instance, artificial intelligence, database theory, graph theory, and statistical physics. From a practical viewpoint, it is beneficial to approximately solve CSPs. When one tries to approximate the total number of truth assignments that satisfy all Boolean constraints for (unweighted) Boolean CSPs, there is a know...
متن کاملApproximating Partition Functions of Bounded-Degree Boolean Counting Constraint Satisfaction Problems
We study the complexity of approximate counting Constraint Satisfaction Problems (#CSPs) in a bounded degree setting. Specifically, given a Boolean constraint language Γ and a degree bound ∆, we study the complexity of #CSP∆(Γ), which is the problem of counting satisfying assignments to CSP instances with constraints from Γ and whose variables can appear at most ∆ times. Our main result shows t...
متن کامل